Quantum Walks

نویسنده

  • Norio Konno
چکیده

Quantum walks can be considered as a generalized version of the classical random walk. There are two classes of quantum walks, that is, the discrete-time (or coined) and the continuous-time quantum walks. This manuscript treats the discrete case in Part I and continuous case in Part II, respectively. Most of the contents are based on our results. Furthermore, papers on quantum walks are listed in References. Studies of discrete-time walks appeared from the late 1980s from Gudder (1988), for example. Meyer (1996) investigated the model as a quantum lattice gas automaton. Nayak and Vishwanath (2000) and Ambainis et al. (2001) studied intensively the behaviour of discrete-time walks, in particular, the Hadamard walk. In contrast with the central limit theorem for the classical random walks, Konno (2002a, 2005a) showed a new type of weak limit theorems for the one-dimensional lattice. Grimmett, Janson, and Scudo (2004) extended the limit theorem to a wider range of the walks. On the other hand, the continuous-time quantum walk was introduced and studied by Childs, Farhi, and Gutmann (2002). Excellent reviews on quantum walks are found in Kempe (2003), Tregenna et al. (2003), Ambainis (2003), Kendon (2007).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Unitary equivalent classes of one-dimensional quantum walks

This study investigates unitary equivalent classes of one-dimensional quantum walks. We prove that one-dimensional quantum walks are unitary equivalent to quantum walks of Ambainis type and that translation-invariant one-dimensional quantum walks are Szegedy walks. We also present a necessary and sufficient condition for a onedimensional quantum walk to be a Szegedy walk.

متن کامل

Workshop of Quantum Simulation and Quantum Walks

[Invited talk] Novel approach for the implementation of quantum walks in linear optics setups Quantum walks without coin: a link between the properties of a graph and the admissible walks over it

متن کامل

The expressive power of quantum walks in terms of language acceptance

Discrete time quantum walks are known to be universal for quantum computation. This has been proven by showing that they can simulate a universal quantum gate set. In this paper, we examine computation by quantum walks in terms of language acceptance, and present two ways in which discrete time quantum walks can accept some languages with certainty. These walks can take quantum as well as class...

متن کامل

Formal languages analysed by quantum walks

Discrete time quantum walks are known to be universal for quantum computation. This has been proven by showing that they can simulate a universal gate set. In this paper we examine computation in terms of language acceptance and present two ways in which discrete time quantum walks can accept some languages with certainty. These walks can take quantum as well as classical inputs, and we show th...

متن کامل

Analysis of Absorbing Times of Quantum Walks

Quantum walks are expected to provide useful algorithmic tools for quantum computation. This paper introduces absorbing probability and time of quantum walks and gives both numerical simulation results and theoretical analyses on Hadamard walks on the line and symmetric walks on the hypercube from the viewpoint of absorbing probability and time. Our results may be suggestive in constructing eff...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007